From Euclid to Present: A Collection of Proofs regarding the Infinitude of Primes
نویسنده
چکیده
Prime numbers are considered the basic building blocks of the counting numbers, and thus a natural question is: Are there infinitely many primes? Around 300BC, Euclid demonstrated, with a proof by contradiction, that infinitely many prime numbers exist. Since his work, the development of various fields of mathematics has produced subsequent proofs of the infinitude of primes. Each new and unique proof gives the mathematical community a glimpse into better understanding the prime numbers. Here, we will examine a collection of proofs of the infinitude of primes, and explore why prime numbers are important.
منابع مشابه
The Primes: Infinitude, Density and Substance
The title of this section is surely, along with the uniqueness of factorization, the most basic and important fact in number theory. The first recorded proof was by Euclid, and we gave it at the beginning of the course. There have since been (very!) many other proofs, many of which have their own merits and drawbacks. It is entirely natural to look for further proofs: in terms of the arithmetic...
متن کاملPrime Numbers in Certain Arithmetic Progressions
We discuss to what extent Euclid’s elementary proof of the infinitude of primes can be modified so as to show infinitude of primes in arithmetic progressions (Dirichlet’s theorem). Murty had shown earlier that such proofs can exist if and only if the residue class (mod k ) has order 1 or 2. After reviewing this work, we consider generalizations of this question to algebraic number fields.
متن کاملIRRATIONALITY MEASURE AND LOWER BOUNDS FOR π(x)
One of the most important functions in number theory is π(x), the number of primes at most x. Many of the proofs of the infinitude of primes fall naturally into one of two categories. First, there are those proofs which provide a lower bound for π(x). A classic example of this is Chebyshev’s proof that there is a constant c such that cx/ log x ≤ π(x). Another method of proof is to deduce a cont...
متن کاملA Variant of the Euclid-Mullin Sequence Containing Every Prime
We consider a generalization of Euclid’s proof of the infinitude of primes and show that it leads to variants of the Euclid-Mullin sequence that provably contain every prime number.
متن کاملEuclidean Proofs of Dirichlet’s Theorem
Euclid’s proof of the infinitude of the primes is a paragon of simplicity: given a finite list of primes, multiply them together and add one. The resulting number, say N , is not divisible by any prime on the list, so any prime factor of N is a new prime. Some special cases of Dirichlet’s theorem admit a simple proof following Euclid’s model, such as the case of 1 mod 4 or 5 mod 6. (We mean by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014